A parallel algorithm for generalized networks
نویسندگان
چکیده
منابع مشابه
Generalized Algorithm for Parallel Sorting on Product Networks
We generalize the well-known odd-even merge sorting algorithm, originally due to Batcher [2], and show how this generalized algorithm can be applied to sorting on product networks. If G is an arbitrary factor graph with N nodes, its r-dimensional product contains N r nodes. Our algorithm sorts N r keys stored in the r-dimensional product of G in O r F N ( ( )) 2 time, where F(N) depends on G. W...
متن کاملParameter estimation for a generalized parallel loop scheduling algorithm
Algorithms that dynamically schedule parallel loop iterations in a shared-memory mul-tiprocessor have been proposed to balance the processors' workload while maintaining low scheduling overhead. However, none of the existing strategies perform well for all types of loops on all types of system architectures. We present a generalized loop scheduling algorithm that can be adjusted to match the lo...
متن کاملA New Parallel Algorithm for Generalized LR Parsing
Tomita's parsing algorithm [~Ibmita 86], which adapted the LR parsing algorithm to context fl'ee grammars, makes use of a breadth-first strategy to handle LR table conflicts. As the breadth-first strategy is compatible with parallel processing, we can easily develop a parallel generalized LR parser b~ed on Tomita's algorithm [Tanaka 89]. However, there is a problem in that this algorithm synchr...
متن کاملA Generalized Parallel Algorithm for Frequent Itemset Mining
A parallel algorithm for finding the frequent itemsets in a set of transactions is presented. The frequent individual items are identified by their index. We assume that processors number (m) is less than the frequent items number (n). At the first stage, every processor Pi, i ∈ {1, . . . ,m − 1} sequentially computes the frequent itemsets from the interval Ii = [(i − 1) · p + 1, i · p], where ...
متن کاملA Parallel Genetic Algorithm for Generalized Vertex Cover Problem
This paper presents a parallel genetic algorithm for generalised vertex cover problem( GVCP) using Hadoop Map-Reduce framework. The proposed Map-Reduce implementation helps to run the genetic algorithm for generalized vertex cover problem(GVCP) on multiple machines parallely and computes the solution in relatively short time. Keywords— Parallel genetic algorithm,generalized vertex cover problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 1988
ISSN: 0254-5330,1572-9338
DOI: 10.1007/bf02186477